A Mapping Shortening Algorithm for Polar Codes
نویسندگان
چکیده
منابع مشابه
A New Method for Color Gamut Mapping by Genetic Algorithm
To reproduce an image, it is necessary to map out of gamut colors of the image to destination gamut. It is clear that the best color gamut mapping introduces the perceptually closest image to the original one. In this study, a new color gamut mapping is purposed by the aid of Genetic Algorithm (GA). The color difference between the original and mapped images based on S-LAB formula was chosen as...
متن کاملAn efficient secure channel coding scheme based on polar codes
In this paper, we propose a new framework for joint encryption encoding scheme based on polar codes, namely efficient and secure joint secret key encryption channel coding scheme. The issue of using new coding structure, i.e. polar codes in Rao-Nam (RN) like schemes is addressed. Cryptanalysis methods show that the proposed scheme has an acceptable level of security with a relatively smaller ke...
متن کاملA RM-Polar Codes
Introduction: Polar codes are a major breakthrough in coding theory [1]. They can achieve Shannon capacity with a simple encoder and a simple successive cancellation (SC) decoder, both with low complexity of the order of ( ) N N log O , where N is the code block size. But for short and moderate lengths, the error rate performance of polar codes with the SC decoding is not as good as LDPC or tur...
متن کاملA H-ARQ scheme for polar codes
We consider the problem of supporting H-ARQ with polar codes. For supporting H-ARQ, we propose to create redundancy versions based on different, but equivalent, subsets of a polar code. The equivalent subsets are created from an initial subset of a polar code using an inherent symmetry in polar code construction. A greedy construction is used to create the initial subset of a polar code. We dem...
متن کاملPolar codes for Arbitrary DMCs
Polar codes are constructed for arbitrary channels by imposing an arbitrary quasigroup structure on the input alphabet. Just as with “usual” polar codes, the block error probability under successive cancellation decoding is o(2−N 1/2− ), where N is the block length. The encoding and decoding in this coding scheme can be implemented with a complexity of O(N logN). It is shown that the same techn...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Access
سال: 2019
ISSN: 2169-3536
DOI: 10.1109/access.2019.2926739